|
In mathematics, a Carleman matrix is a matrix used to convert function composition into matrix multiplication. It is often used in iteration theory to find the continuous iteration of functions which cannot be iterated by pattern recognition alone. Other uses of Carleman matrices occur in the theory of probability generating functions, and Markov chains. ==Definition== The Carleman matrix of a function is defined as: : so as to satisfy the (Taylor series) equation: : ---- For instance, the computation of by : simply amounts to the dot-product of row 1 of with a column vector . The entries of in the next row give the 2nd power of : : and also, in order to have the zero'th power of in , we aadopt the row 0 containing zeros everywhere except the first position, such that : Thus, the dot product of with the column vector yields the column vector : 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Carleman matrix」の詳細全文を読む スポンサード リンク
|